Iterated discriminants

نویسندگان

  • Daniel Lazard
  • Scott McCallum
چکیده

It is shown that the discriminant of a discriminant has the same irreducible factors as the product of seven polynomials which are defined as the GCD of the generators of an elimination ideal. Under tame conditions of genericity, three of these polynomials are irreducible and generate the corresponding elimination ideal, while the four other are equal to one. Moreover the factors of two of these polynomials are factors of multiplicity at least two of the iterated discriminant and the factors of two others of the seven polynomials have multiplicity at least three. The proof involves an extended use of the notion of generic point of an algebraic variety and a careful study of the singularities of the hypersurface defined by a discriminant, which are interesting by them selves.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit factors of some iterated resultants and discriminants

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into irreducible factors of several constructions involving two times iterated univariate resultants and discriminants over the integer universal ring of coe cien...

متن کامل

Chaotic property for non-autonomous iterated function system

In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...

متن کامل

Controller Placement in Software Defined Network using Iterated Local Search

Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...

متن کامل

Carrier detection in hemophilia A: a cooperative international study. II. The efficacy of a universal discriminant.

Factor VIII (F.VIII) and von Willebrand factor (VWF):Ag data collected by eight laboratories on a total of 336 obligatory carriers of hemophilia A and 137 normal women were used to answer several questions concerning the construction of linear discriminants for carrier detection. It was found: that a "universal" linear discriminant can be constructed which is suitable for use in all laboratorie...

متن کامل

Rotation number and its properties for iterated function and non-autonomous systems  

The main purpose of this paper is to introduce the rotation number for non-autonomous and iterated function systems. First, we define iterated function systems and the lift of these types of systems on the unit circle. In the following, we define the rotation number and investigate the conditions of existence and uniqueness of this number for our systems. Then, the notions rotational entropy an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2009